Expounding the First Incompleteness Theorem
نویسنده
چکیده
Part 1. From Gödel 1931 to Kleene 1943 2 1. Notation and terminology 2 2. Gödel 1931: in the beginning 3 3. Tarksi 1933: truth (but not proof) 7 4. Gödel 1934: the Princeton lectures 8 5. Carnap 1934: does he prove the diagonal lemma? 11 6. Kleene 1936: general recursive functions and a new proof 12 7. Rosser 1936: strengthening the first theorem 13 8. Turing 1936, 1938: incompleteness assumed 15 9. Rosser 1939: the story so far 15 10. Hilbert and Bernays 1939: the First Theorem revisited 17 11. Kleene 1943: proving the First Theorem again 17
منابع مشابه
Theorems of Tarski's Undefinability and Godel's Second Incompleteness - Computationally
We show that the existence of a finitely axiomatized theory which can prove all the true Σ1 sentences may imply Gödel’s Second Incompleteness Theorem, by incorporating some bi-theoretic version of the derivability conditions (first discussed by Detlefsen 2001). We also argue that Tarski’s theorem on the undefinability of truth is Gödel’s first incompleteness theorem relativized to definable ora...
متن کاملGödel incompleteness theorems and the limits of their applicability. I
This is a survey of results related to the Gödel incompleteness theorems and the limits of their applicability. The first part of the paper discusses Gödel’s own formulations along with modern strengthenings of the first incompleteness theorem. Various forms and proofs of this theorem are compared. Incompleteness results related to algorithmic problems and mathematically natural examples of unp...
متن کاملThe Surprise Examination Paradox and the Second Incompleteness Theorem
Few theorems in the history of mathematics have inspired mathematicians and philosophers as much as Gödel’s incompleteness theorems. The first incompleteness theorem states that, for any rich enough consistent mathematical theory, there exists a statement that cannot be proved or disproved within the theory. The second incompleteness theorem states that for any rich enough consistent mathematic...
متن کاملGödel-Rosser's Incompleteness Theorem, generalized and optimized for definable theories
Gödel’s First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a syntactic-semantic notion (that is the consistency of a theory with the set of all true Πn sentences or equivalently the Σn soundness of the theory) that corresponds to Gödel’s notion of ω-consistency in an appropriate way. It is also shown that Rosser’s Incomp...
متن کاملGödel's Incompleteness Theorems
Gödel’s two incompleteness theorems [2] are formalised, following a careful presentation by Świerczkowski [3], in the theory of hereditarily finite sets. This represents the first ever machine-assisted proof of the second incompleteness theorem. Compared with traditional formalisations using Peano arithmetic [1], coding is simpler, with no need to formalise the notion of multiplication (let alo...
متن کامل